Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis

Experimental Evaluation • Given • A set of (static) service providers • Each : location . • A set of (dynamic) users • Each : location and arriving time . • Cost Function : any metric distance function • Find an online matching to minimize the total cost MinSum(M)= s.t. • Cardinality Constraint: |M|=min{|T|, |W|} • Real‐Time Constraint: Once a user t appears, a service provider must be immediately assigned to t before the next user appears. • Invariable Constraint: Once a user t is assigned to a service provider w, the match (t, w) cannot be changed • Online Algorithm Evaluation: Competitive Ratio (CR) • Adversarial Model: Worst‐Case Analysis •